منابع مشابه
Inequalities for Finite Group Permutation Modules
If f is a nonzero complex-valued function defined on a finite abelian group A and f̂ is its Fourier transform, then | supp(f)|| supp(f̂)| ≥ |A|, where supp(f) and supp(f̂) are the supports of f and f̂ . In this paper we generalize this known result in several directions. In particular, we prove an analogous inequality where the abelian group A is replaced by a transitive right G-set, where G is an ...
متن کاملA Systematic Martingale Construction With Applications to Permutation Inequalities
We illustrate a process that constructs martingales with help from matrix products that arise naturally in the theory of sampling without replacement. The usefulness of the new martingales is illustrated by the development of maximal inequalities for permuted sequences of real numbers. Some of these inequalities are new and some are variations of classical inequalities like those introduced by ...
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملPermutation codes, source coding and a generalisation of Bollobás-Lubell-Yamamoto-Meshalkin and Kraft inequalities
We develop a general framework to prove Krafttype inequalities for prefix-free permutation codes for source coding with various notions of permutation code and prefix. We also show that the McMillan-type converse theorem in most of these cases does not hold, and give a general form of a counterexample. Our approach is more general and works for other structures besides permutation codes. The cl...
متن کاملPermutation tableaux and permutation patterns
Lauren Williams (joint work with Einar Steingrímsson) We introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the " Le-diagrams " of Alex Postnikov. The structure of these tableaux is in some ways more transparent than the structure of permutations; therefore we believe tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Inequalities & Applications
سال: 2014
ISSN: 1331-4343
DOI: 10.7153/mia-17-31